Analysing Similarity in Examination Timetabling
نویسندگان
چکیده
In this paper we carry out an investigation of some of the major features of exam timetabling problems with a view to developing a similarity measure. This similarity measure will be used within a casebased reasoning (CBR) system to match a new problem with one from a case-base of previously solved problems. The case base will also store the heuristic or meta-heuristic technique(s) applied most successfully to each problem stored. The technique(s) stored with the matched case will be retrieved and applied to the new case. The CBR assumption in our system is that similar problems can be solved equally well by the same
منابع مشابه
Using Simulated Annealing to study behaviour of various Exam Timetabling data sets
In this paper we use a simple simulated annealing (SA) metaheuristic as the basis for comparing behaviour of a number of different examination timetabling problems when optimised from initial solutions given by a largest degree graph-colouring heuristic with backtracking. The ultimate aim of our work is to develop a measure of similarity between exam timetabling problems. By similarity we mean ...
متن کاملAnalysing the High Level Heuristics within a Graph Based Hyper-heuristic
This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...
متن کاملA new binary model for university examination timetabling: a case study
Examination timetabling problem (ETP) is one of the most important issues in universities. An improper timetable may result in students' dissatisfaction as it may not let them study enough between two sequential exams. In addition, the many exams to be scheduled, the large number of students who have taken different courses, the limited number of rooms, and some constraints su...
متن کاملA Novel Similarity Measure for Heuristic Selection in Examination Timetabling
Metaheuristic approaches to examination timetabling problems are usually split up into two phases: initialisation phase in which a heuristic is employed to construct an initial solution and improvement phase which employs a metaheuristic. Different hybridisations of metaheuristics with sequential heuristics are known to lead to solutions of different quality. A Case Based Reasoning CBR methodol...
متن کاملCase-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many combinations of pairing candidate construction heuristics with a metaheuristic. Different pairings are known to produce solutions of varying quality. In this paper we propose a Case Based Reasoning methodology for sel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005